On discrete lot-sizing and scheduling on identical parallel machines
نویسندگان
چکیده
منابع مشابه
On discrete lot-sizing and scheduling on identical parallel machines
We consider the multi-item discrete lot-sizing and scheduling problem on identical parallel machines. Based on the fact that the machines are identical, we introduce aggregate integer variables instead of individual variables for each machine. For the problem with start-up costs, we show that the inequalities based on a unit flow formulation for each machine can be replaced by a single integer ...
متن کاملMulti-product lot-sizing and scheduling on unrelated parallel machines
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملSolving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
AND
متن کاملExact and heuristic approaches for lot splitting and scheduling on identical parallel machines
In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled from, a list of components. During production, each component can be split into one or several lots of different sizes and each lot will be produced independently on one of a group of identical parallel machines. We formul...
متن کاملHybrid methods for lot sizing on parallel machines
We consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines, and apply Dantzig-Wolfe decomposition to a strong reformulation of the problem. Unlike in the traditional approach where the linking constraints are the capacity constraints, we use the flow constraints, i.e. the demand constraints, as linking constraints. The aim of this approach is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2011
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-011-0280-8